Hamming Distance Computation in Unreliable Resistive Memory
نویسندگان
چکیده
منابع مشابه
Tight Cell-Probe Bounds for Online Hamming Distance Computation
We show tight bounds for online Hamming distance computation in the cell-probe model with word size w. The task is to output the Hamming distance between a fixed string of length n and the last n symbols of a stream. We give a lower bound of Ω ( δ w logn ) time on average per output, where δ is the number of bits needed to represent an input symbol. We argue that this bound is tight within the ...
متن کاملSecure Hamming Distance Based Computation and Its Applications
This paper examines secure two-party computation of functions which depend only on the Hamming distance of the inputs of the two parties. We present efficient protocols for computing these functions. In particular, we present protocols which are secure in the sense of full simulatability against malicious adversaries. We show different applications of this family of functions, including a proto...
متن کاملSHADE: Secure HAmming DistancE Computation from Oblivious Transfer
We introduce two new schemes for securely computing Hamming distance in the two-party setting. Our first scheme is a very efficient protocol, based solely on 1-out-of-2 Oblivious Transfer, that achieves full security in the semi-honest setting and one-sided security in the malicious setting. Moreover we show that this protocol is significantly more efficient than the previous proposals, that ar...
متن کاملComputation of Minimum Hamming Weight for Linear Codes
In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$ which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...
متن کاملHamming distance for conjugates
Let x, y be strings of equal length. The Hamming distance h(x, y) between x and y is the number of positions in which x and y differ. If x is a cyclic shift of y, we say x and y are conjugates. We consider f(x, y), the Hamming distance between the conjugates xy and yx. Over a binary alphabet f(x, y) is always even, and must satisfy a further technical condition. By contrast, over an alphabet of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2018
ISSN: 0090-6778,1558-0857
DOI: 10.1109/tcomm.2018.2840717